Computing the ℓ-power torsion of an elliptic curve over a finite field

نویسندگان

  • Josep M. Miret
  • Ramiro Moreno
  • Anna Rio
  • Magda Valls
چکیده

The algorithm we develop outputs the order and the structure, including generators, of the -Sylow subgroup of the group of rational points of an elliptic curve defined over a finite field. To do this, we do not assume any knowledge of the group order. We are able to choose points in such a way that a linear number of successive -divisions leads to generators of the subgroup under consideration. After the computation of a couple of polynomials, each division step relies on finding rational roots of polynomials of degree . We specify in complete detail the case = 3, when the complexity of each trisection is given by the computation of cubic roots in finite fields.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p

We show that to solve the discrete log problem in a subgroup of order p of an elliptic curve over the finite field of characteristic p one needs O(ln p) operations in this field. Let Fq be the finite field of q = p l elements. We define an elliptic curve E over Fq to be an equation of the form

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

The Discrete Logarithm Problem on the p-torsion Subgroup of Elliptic Curves

An ongoing challenge in cryptography is to find groups in which the DLP is computationally infeasible, that is, for which the best known attack is exponential in log(N). Such a group can be used as the setting for many cryptographic protocols, from Diffie-Hellman key exchange to El Gamal encryption ([14], 159). The most prominent example, first proposed in 1985, is a subgroup of points of an el...

متن کامل

The Geometry of Elliptic Curves over Finite Fields

We first provide an overview of the basic results in the geometry of elliptic curves, introducing the Picard Group, Weierstrass Equations, and Isogenies. This is followed by a discussion of the structure of m-torsion points on an elliptic curve, introducing such tools as the Weil pairing and the l-adic Tate module. The paper culminates in a theorem counting the rational points on an elliptic cu...

متن کامل

Constructing elliptic curves over finite fields with prescribed torsion

The modular curve X1(N) parametrizes elliptic curves with a point of order N . For N ≤ 50 we obtain plane models of X1(N) that have been optimized for fast computation, and provide explicit birational maps to transform a point on our model of X1(N) to an elliptic curve. Over a finite field, these allow us to quickly construct elliptic curves containing a point of order N , and can accelerate th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Comput.

دوره 78  شماره 

صفحات  -

تاریخ انتشار 2009